Factorization of the numeric value [Brute Force]

def factorize_number(N):
    '''
    Factorization of the numeric value.
    :param num: numeric value (int, > 0)
    :return: divisors as list
    '''
    if N < 3:
        return [N]
    devisor = 2
    res = []
    while N > 1:
        if N % devisor == 0:
            res.append(devisor)
            N //= devisor
        else:
            devisor += 1
    return res

Test

def test_sort(algorithm):

    print("Testing:", algorithm.__doc__)

    print("testcase #1: ", end="")
    N = 2
    A_factorized = [2]
    Res = algorithm(N)
    print("Ok" if Res == A_factorized else "Fail")

    print("testcase #2: ", end="")
    N = 1024
    A_factorized = [2]*10
    Res = algorithm(N)
    print("Ok" if Res == A_factorized else "Fail")

    print("testcase #3: ", end="")
    N = 889
    A_factorized = [7, 127]
    Res = algorithm(N)
    print("Ok" if Res == A_factorized else "Fail")

    print("testcase #4: ", end="")
    N = 1087
    A_factorized = [1087]
    Res = algorithm(N)
    print("Ok" if Res == A_factorized else "Fail")

if __name__ == "__main__":
    test_sort(factorize_number)